Good Relations with R

Given k sets of objects X1, . . . , Xk, a k-ary relation R on D(R) = (X1, . . . , Xk) is a subset G(R) of the Cartesian product X1 × · · · ×Xk. I.e., D(R) is a k-tuple of sets and G(R) is a set of k-tuples. We refer to D(R) and G(R) as the domain and the graph of the relation R, respectively (alternative notions are that of ground and figure, respectively). Relations are a very fundamental mathematical concept: well-known examples include the linear order defined on the set of integers, the equivalence relation, notions of preference relations used in economics and political sciences, etc. Package relations provides data structures along with common basic operations for relations and also relation ensembles (collections of relations with the same domain), as well as various algorithms for finding suitable consensus relations for given relation ensembles.